Pseudorandomness of binary sequences derived from linear recursions
نویسنده
چکیده
In this paper we study the pseudorandomness of finite binary sequences derived from linear recursions. We show, that the well-distribution measure is small. Furthermore we also show that the correlation measures are small for small correlation orders, but if the order of the correlation is greater than the order of the linear recursion, then the correlation can be large. 2000 Mathematics Subject Classification: Primary 11K45
منابع مشابه
On $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients
We investigate the k-error linear complexity of pseudorandom binary sequences of period pr derived from the Euler quotients modulo pr−1, a power of an odd prime p for r ≥ 2. When r = 2, this is just the case of polynomial quotients (including Fermat quotients) modulo p, which has been studied in an earlier work of Chen, Niu and Wu. In this work, we establish a recursive relation on the k-error ...
متن کاملNew Quaternary Sequences with Ideal Autocorrelation Constructed from Legendre Sequences
In this paper, for an odd prime p, new quaternary sequences of even period 2p with ideal autocorrelation property are constructed using the binary Legendre sequences of period p. For the new quaternary sequences, two properties which are considered as the major characteristics of pseudo-random sequences are derived. Firstly, the autocorrelation distribution of the proposed quaternary sequences ...
متن کاملBinary Additive Problems: Recursions for Numbers of Representations
We prove some general recursions for the numbers of representations of positive integers as a sum x + y, x ∈ X, y ∈ Y, where X, Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy, Chen and other binary partitions .
متن کاملOn Pseudorandomness in Families of Sequences Derived from the Legendre Symbol
Abstract. We construct a family of finite binary sequences which has a remarkable uniformity with respect to specification of several terms and which also has the property that every sequence in the family has small measures of normality, well distribution in arithmetical progressions and multiple correlations. We also construct a pseudorandom bit generator whose output consists of members of t...
متن کاملCryptographic Pseudo-Random Sequences from the Chaotic Henon Map
A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and auto-correlation are investigated. All these properties of the sequences suggest a strong resemblance to random sequences. Results of statistical testing of the seq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Periodica Mathematica Hungarica
دوره 71 شماره
صفحات -
تاریخ انتشار 2015